Palindromic Numbers in Arithmetic Progressions
نویسندگان
چکیده
Integers have many interesting properties. In this paper it will be shown that, for an arbitrary nonconstant arithmetic progression {an}TM=l of positive integers (denoted by N), either {an}TM=l contains infinitely many palindromic numbers or else 10|aw for every n GN. (This result is a generalization of the theorem concerning the existence of palindromic multiples, cf. [2].) More generally, for any number system base b, a nonconstant arithmetic progression of positive integers contains infinitely many palindromic numbers if and only if there exists a member of the progression not divisible by b.
منابع مشابه
A 43 INTEGERS 12 ( 2012 ) ARITHMETIC PROGRESSIONS IN THE POLYGONAL NUMBERS Kenneth
In this paper, we investigate arithmetic progressions in the polygonal numbers with a fixed number of sides. We first show that four-term arithmetic progressions cannot exist. We then describe explicitly how to find all three-term arithmetic progressions. Finally, we show that not only are there infinitely many three-term arithmetic progressions, but that there are infinitely many three-term ar...
متن کاملOn rainbow 4-term arithmetic progressions
{sl Let $[n]={1,dots, n}$ be colored in $k$ colors. A rainbow AP$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. Conlon, Jungi'{c} and Radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbow AP(4) free, when $n$ is even. Based on their construction, we show that such a coloring of $[4n]$...
متن کاملArithmetic Progressions of Four Squares
Suppose a, b, c, and d are rational numbers such that a2, b2, c2, and d2 form an arithmetic progression: the differences b2−a2, c2−b2, and d2−c2 are equal. One possibility is that the arithmetic progression is constant: a2, a2, a2, a2. Are there arithmetic progressions of four rational squares which are not constant? This question was first raised by Fermat in 1640. There are no such progressio...
متن کاملAvoiding triples in arithmetic progression ∗
Some patterns cannot be avoided ad infinitum. A well-known example of such a pattern is an arithmetic progression in partitions of natural numbers. We observed that in order to avoid arithmetic progressions, other patterns emerge. A visualization is presented that reveals these patterns. We capitalize on the observed patterns by constructing techniques to avoid arithmetic progressions. More for...
متن کاملThe Distribution of Smooth Numbers in Arithmetic Progressions
We say that a number n is y-smooth if all the prime factors of n lie below y. Let S(y) denote the set of all y-smooth numbers, and let S(x, y) denote the set of y-smooth numbers below x. Let Ψ(x, y) denote the number of smooth integers below x; thus Ψ(x, y) is the cardinality of S(x, y). In this note we consider the distribution of smooth numbers among arithmetic progressions a (mod q). We supp...
متن کامل